Planning Using Dynamic Epistemic Logic: Correspondence and Complexity
نویسنده
چکیده
A growing community investigates planning using dynamic epistemic logic. Another framework based on similar ideas is knowledgebased programs as plans. Here we show how actions correspond in the two frameworks. We finally discuss fragments of DEL planning obtained by the restriction of event models. Fragments are separated by virtue of their computational complexity.
منابع مشابه
Automata Techniques for Epistemic Protocol Synthesis
In this work we aim at applying automata techniques to problems studied in Dynamic Epistemic Logic, such as epistemic planning. To do so, we first remark that repeatedly executing ad infinitum a propositional event model from an initial epistemic model yields a relational structure that can be finitely represented with automata. This correspondence, together with recent results on uniform strat...
متن کاملComplexity Results in Epistemic Planning
Epistemic planning is a very expressive framework that extends automated planning by the incorporation of dynamic epistemic logic (DEL). We provide complexity results on the plan existence problem for multi-agent planning tasks, focusing on purely epistemic actions with propositional preconditions. We show that moving from epistemic preconditions to propositional preconditions makes it decidabl...
متن کاملOn the Impact of Modal Depth in Epistemic Planning
Epistemic planning is a variant of automated planning in the framework of dynamic epistemic logic. In recent works, the epistemic planning problem has been proved to be undecidable when preconditions of events can be epistemic formulas of arbitrary complexity, and in particular arbitrary modal depth. It is known however that when preconditions are propositional (and there are no postconditions)...
متن کاملA Gentle Introduction to Epistemic Planning: The DEL Approach
Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning. In this paper, we aim to give an accessible introduction to DEL-based epistemic planning. The paper starts with the most classical framework for planning, ...
متن کاملUndecidability in Epistemic Planning
Dynamic epistemic logic (DEL) provides a very expressive framework for multi-agent planning that can deal with nondeterminism, partial observability, sensing actions, and arbitrary nesting of beliefs about other agents’ beliefs. However, as we show in this paper, this expressiveness comes at a price. The planning framework is undecidable, even if we allow only purely epistemic actions (actions ...
متن کامل